Coalgebraic algebra
نویسندگان
چکیده
منابع مشابه
On the Coalgebraic Theory of Kleene Algebra with Tests
We develop a coalgebraic theory of Kleene algebra with tests (KAT) along the lines of Rutten (1998) for Kleene algebra (KA) and Chen and Pucella (Electron Notes Theor Comput Sci 82(1), 2003) for a limited version of KAT, resolving some technical issues raised by Chen and Pucella. Our treatment includes a simple definition of the Brzozowski derivative for KAT expressions and an automata-theoreti...
متن کاملA coalgebraic approach to Kleene algebra with tests
Kleene algebra with tests is an extension of Kleene algebra, the algebra of regular expressions, which can be used to reason about programs. We develop a coalgebraic theory of Kleene algebra with Tests, along the lines of the coalgebraic theory of regular expressions based on deterministic automata. Since the known automata-theoretic presentation of Kleene algebra with tests does not lend itsel...
متن کاملCoalgebraic Logic
We present a generalization of modal logic to logical systems which are interpreted on coalgebras of functors on sets. The leading idea is that innnitary modal logic contains characterizing formulas. That is, every model-world pair is characterized up to bisimulation by an innnitary formula. The point of our generalization is to understand this on a deeper level. We do this by studying a frangm...
متن کاملCoalgebraic Expressions
We show that certain fixpoint expressions used to describe finite Kripke polynomial coalgebras can be seen as coalgebraic modal fixpoint formulae. Both the synthesis of a coalgebra from its expression and the ability to check behavioural equivalence follow from the same tableau construction. There is an associated complete equational logic, analogous to Kleene algebra, which may now be seen as ...
متن کاملCoalgebraic Learning
The area of automata learning was pioneered by Angluin in the 80’s [1]. Her original algorithm, which applied to regular languages and deterministic automata, has been extended to various types of automata and used in software and hardware verification. In this talk, we will take an abstract perspective at automata learning. We show how the correctness of the original algorithm and many extensi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Pure and Applied Algebra
سال: 1998
ISSN: 0022-4049
DOI: 10.1016/s0022-4049(97)00076-5